A Distributed Algorithm for Coalition Formation among E-commerce Agents
نویسنده
چکیده
Since no optimal structure exists, organizations have to be exible to dynamically react towards environment changes. In an economic context, agents are strongly autonomous and weakly rational and have to deal with cooperation and competition , as in task repartition domain. This paper proposes an open and distributed protocol based on exchange of preferences computed using qualitative and quantitative criteria: agents will agree on coalitions to form in order to fullll tasks. We are going to prove that our protocol converges to reach consensus. Experimentation shows that the most rigid strategy is not optimal and that higher competition leads to easier consensus.
منابع مشابه
Coalition Signature Scheme in Multi-agent Systems
The Internet will never reach its full potential as an electronic marketplace unless e-commerce agents, or proactive Web Programs, are used to automatically or semi-automatically perform e-commerce tasks. The dynamic and heterogeneous interactions among them and the automations brought by them will create tremendous opportunities as well as introduce the risk and vulnerability for e-commerce. I...
متن کاملLong-term Coalitions for the Electronic Marketplace
This paper presents a detailed overview on coalition formation mechanisms developed in the areas of game theory, distributed artificial intelligence, and electronic commerce. Further it proposes a concept of long-term coalitions for the electronic marketplace based on nurturing customer-vendor relationships. Because trust is an important factor in any form of commercial interactions we use trus...
متن کاملFormation of overlapping coalitions for precedence-ordered task-execution among autonomous agents *
(;ell-satisfaction in multi-agent environments via coalition formation may be beneficial in cases where agents cannot perform goals by themselves or they do so inefficiently. Agent coalition forn|alkm typically requires that each agent must be a member of only Olle coalition. This may lead to wasted resources alld capabilities. Therefore, we. present algorithms that lead agents to the formation...
متن کاملMaximal Clique Based Distributed Coalition Formation for Task Allocation in Large-Scale Multi-agent Systems
We present a fully distributed algorithm for coalition formation among autonomous agents. The algorithm is based on two main ideas. One is a distributed computation of maximal cliques (of bounded sizes) in the underlying graph that captures the interconnection communication topology of the agents. Hence, given the current configuration of the agents, the coalitions that are formed are character...
متن کاملMaximal Clique Based Distributed Group Formation For Task Allocation in Large-Scale Multi-Agent Systems
We present a fully distributed algorithm for group or coalition formation among autonomous agents. The algorithm is based on two main ideas. One is a distributed computation of maximal cliques (of up to pre-specified size) in the underlying graph that captures the interconnection topology of the agents. Hence, given the current configuration of the agents, the groups that are formed are charact...
متن کامل